Arithmetic Properties of the Nn Orlund Polynomial B
نویسنده
چکیده
For any prime p we establish a congruence of Kummer type for the NN orlund polynomial B (x) n , and determine the highest power of p which divides the coeecient denominators of the NN orlund polynomial. This improves the result of 4] where only an upper bound was proven. We deduce a simple formula for the least common denominator of the coeecients. Applications are made for the Stirling polynomials.
منابع مشابه
Cuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملAn O(n Log 3 N) Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems an O(n Log 3 N) Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems
Given a univariate complex polynomial f(x) of degree n with rational coeecients expressed as a ratio of two integers < 2 m , the root problem is to nd all the roots of f(x) up to speciied precision 2 ?. In this paper we assume the arithmetic model for computation. We give an algorithm for the real root problem: where all the roots of the polynomial are real. Our real root algorithm has time cos...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملOn Third Geometric-Arithmetic Index of Graphs
Continuing the work K. C. Das, I. Gutman, B. Furtula, On second geometric-arithmetic index of graphs, Iran. J. Math Chem., 1(2) (2010) 17-28, in this paper we present lower and upper bounds on the third geometric-arithmetic index GA3 and characterize the extremal graphs. Moreover, we give Nordhaus-Gaddum-type result for GA3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007